A public key cryptosystem based on three new provable problems
نویسندگان
چکیده
منابع مشابه
On a new fast public key cryptosystem
This paper presents a new fast public key cryptosystem namely : a key exchange algorithm, a public key encryption algorithm and a digital signature algorithm, based on the difficulty to invert the following function : F (x) = (a× x)Mod(2)Div(2) . Mod is modulo operation , Div is integer division operation , a , p and q are integers where (p > q) . In this paper we also evaluate the hardness of ...
متن کاملA New Public-Key Cryptosystem
It is striking to observe that two decades after the discovery of public-key cryptography, the cryptographer’s toolbox contains only a dozen of asymmetric encryption schemes. This rarity and the fact that today’s most popular schemes had so far defied all complexity classification a.ttempts strongly motivates the design of new asymmetric cryptosystems. Interestingly, the crypt,ographic communit...
متن کاملA New Public Key Cryptosystem based on Matrices
This paper describes a new method for authentication and integrity where the ciphertext is obtained using block upper triangular matrices with elements in p Z , in which the discrete logarithm problem (DLP) defined over a finite group is used. In the proposed public key cryptosystem, the encryption requires very few operations and decryption is equivalent to the DLP and, finally, the signature ...
متن کاملAn Applicable Public-Key-Cryptosystem Based on NP-Complete Problems
The proposed PKC has two main advantages that will make it applicable to the real world. The first one is a decoding algorithm with an expected runtime of O(n) elementary operations. The second advantage is that the corresponding matrix A is of the form A = [A′ | I], where I is the identity matrix and A′ being completely random, in contrast to e.g. McEliece-Type systems (cf. [1]), which means t...
متن کاملNew probabilistic public-key encryption based on the RSA cryptosystem
We propose a novel probabilistic public-key encryption, based on the RSA cryptosystem. We prove that in contrast to the (standardmodel) RSA cryptosystem each user can choose his own encryption exponent from a more extensive set of positive integers than it can be done by the creator of the concrete RSA cryptosystem who chooses and distributes encryption keys among all users. Moreover, we show t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.12.011